Speed scaling for stretch plus energy
نویسندگان
چکیده
We consider speed scaling problems where the objective is to minimize a linear combination of arbitrary scheduling objective S, and energy E . A natural conjecture is that there is an O(1)-competitive algorithm for S on a fixed speed processor if and only if there is an O(1)-competitive algorithm for S + E on a processor with an arbitrary power function. We give evidence to support this conjecture by providing an O(1)-competitive algorithm for the objective of integer stretch plus energy. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of active jobs, replacing the existing speed scaling functions in the literature that depend on the remaining work of active jobs. The new speed functions are more stable and also more efficient. They can support better job select...
متن کاملNon-clairvoyant Speed Scaling for Weighted Flow Time
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow time plus energy to total weighted flow time plus energy. We first consider the non-clairvoyant setting where the size of a job is only known when the job finishes. We show an online algorithm WLAPS that is 8α-competiti...
متن کاملSpeed scaling for weighted flow time
Intel’s SpeedStep and AMD’s PowerNOW technologies allow the Windows XP operating system to dynamically change the speed of the processor to prolong battery life. In this setting, the operating system must not only have a job selection policy to determine which job to run, but also a speed scaling policy to determine the speed at which the job will be run. We give an online speed scaling algorit...
متن کاملSpeed Scaling with an Arbitrary Convex Power Function
All of the theoretical speed scaling research to date has assumed that the power function, which expresses the power consumption P as a function of the processor speed s, is of the form P = s, where α > 1 is some constant. Motivated in part by technological advances, we initiate a study of speed scaling with arbitrary convex power functions. We consider the problem of minimizing the total flow ...
متن کاملScheduling for Speed Bounded Processors
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can scale its speed between 0 and some maximum speed T . The processor uses energy at rate s when run at speed s, where α > 1 is a constant. Most modern processors use dynamic speed scaling to manage their energy usage. This leads to the problem of designing execution strategies that are both energy e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 2012